A Payoff Dynamics Model for Equality-Constrained Population Games
نویسندگان
چکیده
This letter proposes a novel form of continuous-time evolutionary game dynamics for generalized Nash equilibrium seeking in equality-constrained population games. Using Lyapunov stability theory and duality theory, we provide sufficient conditions to guarantee the asymptotic stability, non-emptiness, compactness, optimality equilibria set proposed certain Moreover, illustrate our theoretical developments through numerical simulation an congestion game.
منابع مشابه
A Model for Competence and Integrity in Variable Payoff Games
Agents often have to trust one another when engaging in joint actions. In many cases, no single design team has the authority to assure that agents cooperate. Trust is required when agents hold potentially different values or conflicting goals. This paper presents a framework and some initial experiments for decomposing agent reputation within a multi-agent society into two characteristics: com...
متن کاملExcess Payoff Dynamics, Potential Dynamics, and Stable Games
We consider a model of evolution in games in which agents occasionally receive opportunities to switch strategies, choosing between them using a probabilistic rule. Both the rate at which revision opportunities arrive and the probabilities with which each strategy is chosen are functions of current normalized payoffs. W e call the aggregate dynamics induced by this model excess payoff dynamics....
متن کاملEvolutionary games on networks and payoff invariance under replicator dynamics
The commonly used accumulated payoff scheme is not invariant with respect to shifts of payoff values when applied locally in degree-inhomogeneous population structures. We propose a suitably modified payoff scheme and we show both formally and by numerical simulation, that it leaves the replicator dynamics invariant with respect to affine transformations of the game payoff matrix. We then show ...
متن کاملFaster algorithms for mean-payoff games
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff...
متن کاملAn Improved Algorithm for Discounted Payoff Games
We show that an optimal counterstrategy against a fixed positional strategy in a generalized discounted payoff game, where edges have individual discounts, can be computed in O(mn logm) strongly polynomial time, where n and m are the number of vertices and edges in the game graph. This results in the best known strongly subexponential time bound for solving two-player generalized discounted pay...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2022
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2021.3082865